On the representation of finite deterministic 2-tape automata
نویسندگان
چکیده
منابع مشابه
On the Representation of Finite Deterministic 2-Tape Automata
This paper presents properties of relations between words that are realized by deterministic nite 2-tape automata. It has been made as complete as possible, and is structured by the systematic use of the matrix representation of automata. It is rst shown that deterministic 2-tape automata are characterized as those which can be given a preex matrix representation. Sch utzenberger construct on r...
متن کاملOn the Algebraic Representation of One-Tape Deterministic Turing Machine
An algebraic representation of the Turing machines is given, where the configurations of Turing machines are represented by 4 order tensors, and the transition functions by 8 order tensors. Two types of tensor product are defined, one is to model the evolution of the Turing machines, and the other is to model the compositions of transition functions. It is shown that the two types of tensor pro...
متن کاملFailure Deterministic Finite Automata
Inspired by failure functions found in classical pattern matching algorithms, a failure deterministic finite automaton (FDFA) is defined as a formalism to recognise a regular language. An algorithm, based on formal concept analysis, is proposed for deriving from a given deterministic finite automaton (DFA) a language-equivalent FDFA. The FDFA’s transition diagram has fewer arcs than that of the...
متن کاملOn the Representation of Finite Automata
We give an unique string representation, up to isomorphism, for initially connected deterministic finite automata (ICDFA’s) with n states over an alphabet of k symbols. We show how to generate all these strings for each n and k, and how its enumeration provides an alternative way to obtain the exact number of ICDFA’s. 1 Motivation In symbolic manipulation environments for finite automata, it is...
متن کامل2-tape 1-way Quantum Finite State Automata
1-way quantum finite state automata are reversible in nature, which greatly reduces its accepting property. In fact, the set of languages accepted by 1-way quantum finite automata is a proper subset of regular languages. We introduce 2-tape 1-way quantum finite state automaton (2T1QFA(2))which is a modified version of 1-way 2-head quantum finite state automaton(1QFA(2)). In this paper, we repla...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1999
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00179-0